Large Bounded Degree Trees in Expanding Graphs
نویسندگان
چکیده
منابع مشابه
Large Bounded Degree Trees in Expanding Graphs
A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find arbitrarily large trees with bounded maximum degree. Using a slightly weaker version of Haxell’s result we...
متن کاملSpanning Trees of Bounded Degree Graphs
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by d. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of exponential algorithms. The value of interest is the constant βd such that all connected graphs with degree bound ed by d have at least β d spanning trees wher...
متن کاملUniversal Graphs for Bounded-Degree Trees and Planar Graphs
How small can a graph be that contains as subgraphs all trees on n vertices with maximum degree d? In this paper, this question is answered by constructing such universal graphs that have n vertices and bounded degree (depending only on d). Universal graphs with n vertices and O(n log n) edges are also constructed that contain all bounded-degree planar graphs on n vertices as subgraphs. In gene...
متن کاملLarge 2P3-free graphs with bounded degree
Let ex (D; H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is nite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex (D; H) = O(D 2 ex (D; P m)). Constructively, ex (D; qP m) = (qD 2 ex (D; P m)) if q > 1 and m > 2 (((qD 2) if m = 2). For H = 2P 3 (and D 8), the maximum number of...
متن کاملBounded-Degree Spanning Trees in Randomly Perturbed Graphs
We show that for any xed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding trees into xed dense graphs and into random graphs, and extends a sizeable body of existing research on randomly perturbed graphs. Speci cally, we show that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/278